Writing Weighted Constraints for Large Dependency Grammars
نویسنده
چکیده
Implementing dependency grammar as a set of defeasible declarative rules has fundamental advantages such as expressiveness, automatic disambiguation, and robustness. Although an implementation and a successful large-scale grammar of German are available, so far the construction of constraint dependency grammars has not been described at length. We report on techniques that were used to write the parsing grammar for German and should be useful for a general account of developing a large-scale constraint dependency grammar.
منابع مشابه
PARSEC: A Constraint-Based Parser for Spoken Language Processing
PARSEC1, a text-based and spoken language processing framework based on the Constraint Dependency Grammar (CDG) developed by Maruyama [26,27], is discussed. The scope of CDG is expanded to allow for the analysis of sentences containing lexically ambiguous words, to allow feature analysis in constraints, and to efficiently process multiple sentence candidates that are likely to arise in spoken l...
متن کاملCategorial Dependency Grammars: from Theory to Large Scale Grammars
Categorial Dependency Grammars (CDG) generate unlimited projective and non-projective dependency structures, are completely lexicalized and analyzed in polynomial time. We present an extension of the CDG, also analyzed in polynomial time and dedicated for large scale dependency grammars. We define for the extended CDG a specific method of “Structural Bootstrapping” consisting in incremental con...
متن کاملCategorial dependency grammars
Categorial Dependency Grammars (CDG) introduced in this paper express projective and distant dependencies in classical categorial grammar terms. They treat order constraints in terms of oriented polarized valencies and a bounded commutativity rule. CDGs are expressive, constitute a convenient frame for coupling dependency grammars with linguistic semantics, and with all this, they are parsed in...
متن کاملApproximating Dependency Grammars Through Intersection of Regular Languages
The paper formulates projective dependency grammars in terms of constraints on a string based encoding of dependency trees and develops an approach to obtain a regular approximation for these grammars. In the approach, dependency analyses are encoded with balanced bracketing that encodes dependency relations among the words of the analyzed sentence. The brackets, thus, indicate dependencies rat...
متن کامل“CDG LAB”: a Toolbox for Dependency Grammars and Dependency Treebanks Development
We present “CDG LAB”, a toolkit for development of dependency grammars and treebanks. It uses the Categorial Dependency Grammars (CDG) as a formal model of dependency grammars. CDG are very expressive. They generate unlimited dependency structures, are analyzed in polynomial time and are conservatively extendable by regular type expressions without loss of parsing efficiency. Due to these featu...
متن کامل